Non-Recursive Relations Structure-Functionality

Graph Structure and Recursive Estimation of Noisy Linear Relations

This paper examines estimation problems speci ed by noisy linear relations describing either dynamical models or measurements. Each such problem has a graph structure, which can be exploited to derive recursive estimation algorithms only when the graph is acyclic, i.e., when it is obtained by combining disjoint trees. Aggregation techniques appropriate for reducing an arbitrary graph to an acyc...

Well-Founded Recursive Relations

We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting à la Ferreira-Zantema and a wellfounded relation .. This construction generalizes several variants of the recursive path ordering on terms and of the Knuth-Bendix ordering. It also applies to other domains, of graphs, of infinite terms, of word and tree automata notably. We then exte...

Algebraic Relations for Recursive Sequences

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation an+1 = Aan + Ban−1, by means of algebraic equations in two variables of degree n ∈ N . We do this, as far as we know, like it has never been formalized before. I’d like to precise that the work was develop without the support of any well-kn...

Part-of relations, functionality and dependence

Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version)

1. INTROOUCTION ANO PRELIMINARIES If a context-free grammar is transformed to another context-free grammar in most of the cases it is quite obvious to demand weak equivalence for these two grammars. Transformations on context-free grammars can be defined for several reasons. Oepen-dent on these reasons one may be interested in stronger relations of grammatical similarity. Instead of arbitrary c...